A general representation theory for constructing groups of permutation polynomials
نویسندگان
چکیده
Using the left regular action of a group on itself, we develop a general representation theory for constructing groups of permutation polynomials. As an application of the method, we compute polynomial representations of several abelian and nonabelian groups, and we determine the equivalence classes of the groups of polynomials we construct. In particular, when the size of the group is equal to the size of the field in which the group is represented, all non-identity representation polynomials are necessarily fixed-point free permutation polynomials. §
منابع مشابه
QUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملConstructing Permutation Representations for Matrix Groups
New techniques, both theoretical and practical, are presented for constructing permutation representations for computing with matrix groups defined over finite fields. The permutation representation is constructed on a conjugacy class of subgroups of prime order. We construct a base for the permutation representation, which in turn simplifies the computation of a strong generating set. In addit...
متن کاملNew Constructions of Permutation Polynomials of the Form $x^rh\left(x^{q-1}\right)$ over $\mathbb{F}_{q^2}$
Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation trinomials of the form xh ( x ) over Fq2 , where q = 2 , h(x) = 1+x+x and r, s, t, k > 0 are integers. Their methods are essentially usage of a multiplicative versio...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...
متن کاملOn constructing permutations of finite fields
Motivated by several constructions of permutation polynomials done by several authors (most notably by Zieve), we propose a unified treatment for a large set of classes of permutation polynomials of Fq. Our approach yields a recipe for constructing several new and old classes of permutation polynomials of Fq.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Finite Fields and Their Applications
دوره 35 شماره
صفحات -
تاریخ انتشار 2015